Sojourn times in a random queue with and without preemption
نویسندگان
چکیده
We consider an equilibrium M/M/1 queue in which customers arrive at a random position, both for the preemptive and non-preemptive cases. The Laplace-Stieltjes transforms of their sojourn time distributions are derived and in the latter case it is verified that the result is that of an M/M/1 queue where the server chooses the next task to serve at random.
منابع مشابه
Processor-sharing and Random-service Queues with Semi-markovian Arrivals
We consider single-server queues with exponentially distributed service times, in which the arrival process is governed by a semi-Markov process (SMP). Two service disciplines, processor sharing (PS) and random service (RS), are investigated. We note that the sojourn time distribution of a type-l customer who, upon his arrival, meets k customers already present in the SMP/M/1/PS queue is identi...
متن کاملAnalysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths
This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH -distributions. A GI /M /1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distri...
متن کاملSojourn Time in a Single-Server Queue with Threshold Service Rate Control
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at a low or high rate, which can be adapted at exponential inspection times. When the number of customers in the system is above a given threshold, the service rate is upgraded to the high rate, otherwise, it is downgraded to the low rat...
متن کاملMEAN TANDEM SOJOURN TIMES QUEUE SERVED IN A BY A Tsuyoshi Katayama MULTI - STAGE SINGLE SERVER
This paper presents explicit expressions for the mean sojourn times in a multi-stage tandem queue, with Poisson arrival and general service times, served by a s,ingle server with a cyclic switching rule, M/GI-G2-"'GN/l. The expressions are derived using the results of the two-stage tandem queue, M/GI-G2/1, already considered by some authors and the well-known Pollaczek-Khintchine formula. With ...
متن کاملThe cyclic queue and the tandem queue
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number N of customers cycles through this network. We determine the joint sojourn time distribution of a tagged customer in, first, the general queue and, then, the exponential queue. Subsequently, we indicate how th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 112 شماره
صفحات -
تاریخ انتشار 1999